Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
411	On the Pagenumber of Bipartite Orders Mustafa Alhashem∗ Guy-Vincent Jourdan∗ ∗ Add to Reading List Source URL: www.cccg.ca Language: English - Date: 2005-07-31 13:55:47 NP-complete problems Order theory Bipartite graph Parity Partially ordered set Covering graph FO Interval graph Vertex cover Graph theory Theoretical computer science Mathematics
412	On Two Class-Constrained Versions of the Multiple Knapsack Problem ∗ Hadas Shachnai † Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2013-04-15 10:32:13 Operations research Combinatorial optimization NP-complete problems Mathematical optimization Dynamic programming Knapsack problem Job shop scheduling Optimization problem Polynomial-time approximation scheme Theoretical computer science Computational complexity theory Applied mathematics
413	Mode Directed Path Finding Irene M. Ong1 , Inˆes de Castro Dutra2 , David Page1, V´ıtor Santos Costa2 1 2 Add to Reading List Source URL: pages.cs.wisc.edu Language: English - Date: 2006-07-20 15:45:54 Game artificial intelligence Constraint programming Network theory Shortest path problem Static single assignment form Hypergraph Pathfinding NP-complete problems Decomposition method Theoretical computer science Mathematics Graph theory
414	Interconnection Semantics for Keyword Search in XML Sara Cohen∗ Yaron Kanza Technion—Israel Institute of Add to Reading List Source URL: www.cs.technion.ac.il Language: English - Date: 2007-11-04 06:34:23 Complexity classes NP-complete problems Logic in computer science Graph connectivity Graph theory Tree Connectivity L Boolean satisfiability problem Theoretical computer science Mathematics Applied mathematics
415	ICS 161 — Algorithms — Spring 2005 — Final Exam Please answer the following eight questions on the answer sheets provided. Answers written on other pages or on the wrong sheet will not be scored. Be sure to write y Add to Reading List Source URL: www.ics.uci.edu Language: English - Date: 2005-06-13 12:44:12 NP-complete problems Vertex cover NP-complete Longest common subsequence problem Minimum spanning tree Algorithm Path decomposition Edge coloring Theoretical computer science Computational complexity theory Mathematics
416	Curriculum Vitae Stephen G. Kobourov Department of Computer Science University of Arizona, Tucson AZWeb: http://www.cs.arizona.edu/˜kobourov Email: Add to Reading List Source URL: www.cs.arizona.edu Language: English - Date: 2015-04-13 15:56:42 Topological graph theory Graph drawing NP-complete problems Geometric graph theory Graph embedding Planar graph Graph coloring Force-based algorithms Graph Graph theory Mathematics Theoretical computer science
417	On the possibility of faster SAT algorithms Mihai Pˇatra¸scu∗ AT&T Labs Florham Park, NJ Ryan Williams† Add to Reading List Source URL: www.stanford.edu Language: English - Date: 2009-11-12 23:47:30 NP-complete problems Logic in computer science Exponential time hypothesis 2-satisfiability Boolean satisfiability problem Conjunctive normal form Time complexity Parameterized complexity Dominating set Theoretical computer science Computational complexity theory Applied mathematics
418	LNCSThe Lost Continent of Polynomial Time: Preprocessing and Kernelization Add to Reading List Source URL: www.mrfellows.net Language: English - Date: 2009-10-14 09:25:39 Analysis of algorithms Complexity classes Parameterized complexity Kernelization NP-complete problems Time complexity PP Polynomial NP Theoretical computer science Computational complexity theory Applied mathematics
419	Managing Large Graphs on Multi-Cores With Graph Awareness Vijayan Prabhakaran, Ming Wu, Xuetian Weng Frank McSherry, Lidong Zhou, Maya Haridasan†∗∗ Microsoft Research, †Google Abstract Add to Reading List Source URL: www.usenix.org Language: English - Date: 2015-05-31 08:44:11 Graph Connected component Vertex Connectivity Graph coloring Planar separator theorem Heawood graph Graph theory NP-complete problems Line graph
420	Algorithms Lecture thesection: Approximation Algorithms [Fa’13] Le mieux est l’ennemi du bien. [The best is the enemy of the good.] — Voltaire, La Bégueule (1772) Add to Reading List Source URL: web.engr.illinois.edu Language: English - Date: 2014-12-28 09:03:25 NP-complete problems Approximation algorithm Vertex cover Travelling salesman problem Graph coloring Metric k-center Dynamic programming Christofides algorithm Set cover problem Theoretical computer science Mathematics Computational complexity theory

UPDATE